Algorithms for Minimal Dependency Set and Membership Based on XML Functional Dependency and Multi-Valued Dependency

نویسندگان

  • Zhongping Zhang
  • Chunzhen Fang
چکیده

As the XML functional dependency and multi-valued dependency impact on the normalization design of semi-structured data, definitions of XML functional dependency, XML multi-valued dependency, path dependency base and the minimal dependency set are given in this paper. Algorithms for minimal dependency set and membership with path expression based on the coexistence of XFD and XMVD are then proposed. Finally, the correctness and termination of these algorithms are proved, and their time complexities are analyzed as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Haptic Data Compression Based on a Linear Prediction Model and Quadratic Curve Reconstruction

REGULAR PAPERS An Approach for Identifying Detecting Objects of Null Dereference Yukun Dong A Defense Model of Reactive Worms Based on Dynamic Time Haokun Tang, Shitong Zhu, Jun Huang, and Hong Liu An Improved Algorithm of Quantum Particle Swarm Optimization Yan-xia Jin, Jing Xue, and Zhi-bin Shi Haptic Data Compression Based on a Linear Prediction Model and Quadratic Curve Reconstruction Fengh...

متن کامل

An annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies

A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...

متن کامل

Feature Engineering in Persian Dependency Parser

Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...

متن کامل

A generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences

The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...

متن کامل

Generalized Baum-Welch and Viterbi Algorithms Based on the Direct Dependency among Observations

The parameters of a Hidden Markov Model (HMM) are transition and emission probabilities‎. ‎Both can be estimated using the Baum-Welch algorithm‎. ‎The process of discovering the sequence of hidden states‎, ‎given the sequence of observations‎, ‎is performed by the Viterbi algorithm‎. ‎In both Baum-Welch and Viterbi algorithms‎, ‎it is assumed that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSW

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2014